Multiple Scales in Small-World Graphs
نویسنده
چکیده
Small-world architectures may be implicated in a range of phenomena from disease propagation to networks of neurons in the cerebral cortex [1-2]. While most of the recent attention on small-world networks has focussed on the effect of introducing disorder/randomness into a regular graph, we show that that the fundamental mechanism behind the small-world phenomenon is not dis-order/randomness, but the presence of edges of many different length scales. Consequently, in order to explain the small-world phenomenon, we introduce the concept of multiple scale graphs and then state the multiple length scale hypothesis. Multiple scale graphs form a unifying conceptual framework for the study of evolving graphs. Moreover, small-world behavior in randomly rewired graphs is a consequence of features common to all multiple scale graphs. To support the multiple length scale hypothesis, novel graph architectures are introduced that need not be a result of random rewiring of a regular graph. In each case it is shown that whenever the graph exhibits small-world behavior, it also has edges of diverse length scales. We also show that the distribution of the length scales of the new edges is significantly more important than whether the new edges are long range, medium range or short range.
منابع مشابه
Small-world behaviour in a system of mobile elements
– We analyze the propagation of activity in a system of mobile automata. A number ρL of elements move as random walkers on a lattice of dimension d, while with a small probability p they can jump to any empty site in the system. We show that this system behaves as a Dynamic Small World (DSW) and present analytic and numerical results for several quantities. Our analysis shows that the persisten...
متن کاملMultiple Scales in Small-World Networks
Small-world architectures may be implicated in a range of phenomena from networks of neurons in the cerebral cortex to social networks and propogation of viruses [1]-[2]. Small-world networks are interpolations of regular and random networks that retain the advantages of both regular and random networks by being highly clustered like regular networks and having small average path length between...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملScale-free Graphs for General Aviation Flight Schedules
In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the numb...
متن کاملSmall-world behavior in a system of mobile elements
– We analyze the propagation of activity in a system of mobile automata. A number ρL of elements move as random walkers on a lattice of dimension d, while with a small probability p they can jump to any empty site in the system. We show that this system behaves as a Dynamic Small-World (DSW) and present analytic and numerical results for several quantities. Our analysis shows that the persisten...
متن کامل